Shortest Point - Visible Paths on
نویسندگان
چکیده
In this paper we study the problem of nding the shortest path between two points lying on the surface of a (possibly nonconvex) polyhedron which is constrained so that a given point on the surface of the polyhedron must be seen from some point in the path. Our algorithm runs in time O(n 2 log n) for the convex polyhedron and O(n 3 log n) for nonconvex case. The method used is based on the subdivision of the inward layout and intersecting it with the visibility map of the point to be seen.
منابع مشابه
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملShortest Paths with Single-Point Visibility Constraints
This paper studies the problem of finding the shortest path between two points in presence of single-point visibility constraints. In this type of constraints, there should be at least one point on the output path from which a fixed viewpoint is visible. The problem is studied in various domains including simple polygons, polygonal domains, polyhedral surfaces. The method is based on partitioni...
متن کاملGlow discharge in microfluidic chips for visible analog computing.
Here we present a novel visible analog computing approach for solving a wide class of shortest path problems. Using a microfluidic chip for computation, based on the lighting up of a glow discharge, the solution to maze search problems, the solution of a network shortest path and k-shortest paths problems and the practical application of finding the shortest paths between several landmarks from...
متن کاملShortest Paths with Single-Point Visibility Constraint
This paper studies the problem of finding a shortest path between two points in presence of single-point visibility constraints. In this type of constraints, there should be at least one point on the output path from which a fixed viewpoint is visible. The problem is studied in various domains including simple polygons, polygonal domains, and polyhedral surfaces. The method is based on partitio...
متن کاملQuery-point visibility constrained shortest paths in simple polygons
In this paper, we study the problem of finding the shortest path between two points inside a simple polygon such that there is at least one point on the path fromwhich a query point is visible. We provide an algorithmwhich preprocesses the input in O(n2+nK ) time and space and provides logarithmic query time. The input polygon has n vertices and K is a parameter dependent on the input polygon w...
متن کامل